Slicing communicating automata specifications: polynomial algorithms for model reduction
نویسندگان
چکیده
منابع مشابه
Towards Slicing Communicating Extended Automata
Slicing is a well-established program analysis technique that has applications in debugging, program understanding and model reduction. This paper presents an approach to slicing formal specifications based on communicating extended automata.
متن کاملSlicing AADL Specifications for Model Checking
To combat the state-space explosion problem in model checking larger systems, abstraction techniques can be employed. Here, methods that operate on the system specification before constructing its state space are preferable to those that try to minimize the resulting transition system as they generally reduce peak memory requirements. We sketch a slicing algorithm for system specifications writ...
متن کاملA Kleene theorem and model checking algorithms for existentially bounded communicating automata
The behavior of a network of communicating automata is called existentially bounded if communication events can be scheduled in such a way that the number of messages in transit is always bounded by a value that depends only on the machine, not the run itself. We show a Kleene theorem for existentially bounded communicating automata, namely the equivalence between communicating automata, global...
متن کاملParameterized Communicating Automata: Complementation and Model Checking
We study the language-theoretical aspects of parameterized communicating automata (PCAs), in which processes communicate via rendez-vous. A given PCA can be run on any topology of bounded degree such as pipelines, rings, ranked trees, bus topologies, and grids. We show that, under a context bound, which restricts the local behavior of each process, PCAs are effectively complementable. Complemen...
متن کاملSlicing Object-Z Specifications for Verification
Slicing is the activity of reducing a program or a specification with respect to a given condition (the slicing criterion) such that the condition holds on the full program if and only if it holds on the reduced program. Originating from program analysis the entity to be sliced is usually a program and the slicing criterion a value of a variable at a certain program point. In this paper we pres...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formal Aspects of Computing
سال: 2008
ISSN: 0934-5043,1433-299X
DOI: 10.1007/s00165-008-0086-3